Searching for perfection on hypergraphs
نویسندگان
چکیده
In this paper we study the family of oriented transitive 3–hypergraphs that arrive from cyclic permutations and intervals in the circle to search for the notion of perfection on hypergraphs.
منابع مشابه
Circular Mixed Hypergraphs III: C–perfection
A mixed hypergraph is a tripleH = (X, C,D), whereX is the vertex set and each of C, D is a family of subsets of X, the C-edges and D-edges, respectively. A proper k-coloring of H is an injective mapping c : X → {1, . . . , k} such that each C-edge has two vertices with a common color and each D-edge has two vertices with distinct colors. Maximum number of colors in a coloring using all the colo...
متن کاملThe Shortest Path Algorithms of Hypergraphs Based on Search Strategies
In order to search the shortest path from hypergraphs with unweighted hyperedges, a kind of searching algorithm based on the width-first strategy is presented at first. For hypergraphs with weighted hyperedges, a kind of searching algorithm based on the minimum-cost-first strategy to search the shortest path is presented. In order to enhance the reliability of the two algorithms, their correctn...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملCombinatorial Results on Directed Hypergraphs for the SAT Problem
Directed hypergraphs have already been shown to unveil several combinatorial inspired results for the SAT problem. In this paper we approach the SAT problem by searching a transversal of the directed hypergraphs associated to its instance. We introduce some particular clause orderings and study their influence on the backtrack process, exhibiting a new subclass of CNF for which SAT is polynomia...
متن کاملON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 44 شماره
صفحات -
تاریخ انتشار 2013